4-connected planar graphs are in B3-EPG
نویسندگان
چکیده
We show that every 4-connected planar graph has a B3-EPG representation, i.e., every vertex is represented by a curve on the grid with at most three bends, and two vertices are adjacent if and only if the corresponding curves share an edge of the grid. Our construction is based on a modification of the representation by touching thickened L-shapes proposed by Gonçalves et al. [4].
منابع مشابه
Computing Maximum Cliques in B_2 -EPG Graphs
EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class Bk-EPG is the subclass of EPG graphs where the path on the grid associated to each vertex has at most k bends. Epstein et al. showed in 2013 that computing a maximum clique in B1-EPG graphs is polynomial. As remarked in [Heldt et al., 2014], when the number of bends is at le...
متن کاملPlanar Graphs as VPG-Graphs
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG. We also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a...
متن کاملVPG and EPG bend-numbers of Halin Graphs
A piecewise linear simple curve in the plane made up of k+1 line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a k-bend path. Given a graph G, a collection of k-bend paths in which each path corresponds to a vertex in G and two paths have a common point if and only if the vertices corresponding to them are adjacent i...
متن کاملInternally 4-connected projective-planar graphs
5 Archdeacon proved that projective-planar graphs are characterized by 35 excluded minors. 6 Using this result we show that internally 4-connected projective-planar graphs are characterized 7 by 23 internally 4-connected excluded minors. 8
متن کاملOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Golumbic, Lipshteyn and Stern proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of E-mail addresses: [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]. This work was partially supported by MathAmSud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.04583 شماره
صفحات -
تاریخ انتشار 2017